The Spectrum of a Random Geometric Graph is Concentrated
نویسندگان
چکیده
منابع مشابه
The Spectrum of a Random Geometric Graph Is Concentrated
Consider n points distributed uniformly in [0, 1]d. Form a graph by connecting two points if their mutual distance is no greater than r(n). This gives a random geometric graph, G(Xn; r(n)), which is connected for appropriate r(n). We show that the spectral measure of the transition matrix of the simple random walk (srw) on G(Xn; r(n)) is concentrated, and in fact converges to that of the graph ...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
Hamiltonicity of the random geometric graph
Let X1, . . . , Xn be independent, uniformly random points from [0, 1] . We prove that if we add edges between these points one by one by order of increasing edge length then, with probability tending to 1 as the number of points n tends to ∞, the resulting graph gets its first Hamilton cycle at exactly the same time it loses its last vertex of degree less than two. This answers an open questio...
متن کاملFirefighting on a random geometric graph
Let Gλ be the graph whose vertices are points of a planar Poisson process of density λ, with vertices adjacent if they are within distance 1. A “fire” begins at some vertex and spreads to all neighbors in discrete steps; in the meantime f vertices can be deleted at each time-step. Let fλ be the least f such that, with probability 1, any fire on Gλ can be stopped in finite time. We show that fλ ...
متن کاملRandom Geometric Graph Diameter in the Unit
Let n be a positive integer, and λ > 0 a real number. Let Vn be a set of n points randomly located within the unit disk, which are mutually independent. For 1 ≤ p ≤ ∞, define Gp(λ, n) to be the graph with the vertex set Vn, in which two vertices are adjacent if and only if their `p-distance is at most λ. We call this graph a unit disk random graph. Let λ = c √ ln n/n and let X be the number of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Theoretical Probability
سال: 2007
ISSN: 0894-9840,1572-9230
DOI: 10.1007/s10959-006-0049-7